ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON

Authors

  • Kh. Abolpour Department of Mathematics, Shiraz Beranch, Islamic Azad University, Shiraz, Iran
  • M. M. Zahedi Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran
  • M. Shamsizadeh Department of Mathematics, Graduate University of Advanced Technology, Kerman, Iran
Abstract:

In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finally, we present some examples to clarify the notions and results of this paper.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Bisimulation for BL-general fuzzy automata

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

full text

I-homomorphism for BL-I-General L-fuzzy Automata

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

full text

Transformation of BL-general Fuzzy Automata

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

full text

Reduction of BL-general L-fuzzy Automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

full text

Irreducibility on General Fuzzy Automata

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

full text

Modeling the main and maximum subautomata of an active general fuzzy automaton

In this paper, subcategories with threshold c are examined from an active general fuzzy automaton and the generator from an active general fuzzy automaton is defined and the connections between them are examined. Then, under the main and maximum automata with threshold c, one of the active general fuzzy automata will be defined, and it will be proved that each active general fuzzy automaton can...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 15  issue 7

pages  79- 90

publication date 2018-10-30

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023